Closed 2-cell embeddings of graphs with no V8-minors
نویسندگان
چکیده
A closed 2-cell embedding of a graph embedded in some surface is an embedding such that each face is bounded by a cycle in the graph. The strong embedding conjecture says that every 2-connected graph has a closed 2-cell embedding in some surface. In this paper, we prove that any 2-connected graph without V8 (the M obius 4-ladder) as a minor has a closed 2-cell embedding in some surface. As a corollary, such a graph has a cycle double cover. The proof uses a classi cation of internally-4-connected graphs with no V8-minor (due to Kelmans and independently Robertson), and the proof depends heavily on such a characterization. c © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Directed Graph Embeddings
Definitions of graph embeddings and graph minors for directed graphs are introduced. For the class of 2-terminal directed acyclic graphs (TDAGs) the definitions coincide, and the class is closed under both operations. The usefulness of the directed embedding operation is demonstrated be characterizing all TDAGs with parallel-width at most $k$, which generalizes earlier characterizations of seri...
متن کاملGraph minors and graphs on surfaces
Graph minors and the theory of graphs embedded in surfaces are fundamentally interconnected. Robertson and Seymour used graph minors to prove a generalization of the Kuratowski Theorem to arbitrary surfaces [37], while they also need surface embeddings in their Excluded Minor Theorem [45]. Various recent results related to graph minors and graphs on surfaces are presented.
متن کاملPrimitive Spatial Graphs and Graph Minors
Robertson, Seymour and Thomas characterized linkless embeddings of graphs by flat embeddings, and determined the obstruction set for linkless embeddings. In this paper, we extend flat embeddings to “primitive embeddings” as linkless embeddings to knotless embeddings. Although the obstruction set for knotless embeddings has not been determined, fundamental theorems and conjectures are obtained.
متن کاملOrientable embeddings and orientable cycle double covers of projective-planar graphs
In a closed 2-cell embedding of a graph each face is homeomorphic to an open disk and is bounded by a cycle in the graph. The Orientable Strong Embedding Conjecture says that every 2-connected graph has a closed 2-cell embedding in some orientable surface. This implies both the Cycle Double Cover Conjecture and the Strong Embedding Conjecture. In this paper we prove that every 2-connected proje...
متن کاملPartial duality and closed 2-cell embeddings To Adrian Bondy on his 70th birthday
In 2009 Chmutov introduced the idea of partial duality for embeddings of graphs in surfaces. We discuss some alternative descriptions of partial duality, which demonstrate the symmetry between vertices and faces. One is in terms of band decompositions, and the other is in terms of the gem (graph-encoded map) representation of an embedding. We then use these to investigate when a partial dual is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 230 شماره
صفحات -
تاریخ انتشار 2001